Symbolic method in invariant theory
نویسندگان
چکیده
منابع مشابه
Completion and Invariant Theory in Symbolic Computation and Artificial Intelligence
An outline for the study of invariant theoretic (as structural) and completion (as syntactical) concepts in symbolic computation and artiicial intelligence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artiicial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the...
متن کاملOn deformation method in invariant theory
© Annales de l’institut Fourier, 1997, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...
متن کاملAdventures in Invariant Theory
We provide an introduction to enumerating and constructing invariants of group representations via character methods. The problem is con-textualised via two case studies, arising from our recent work: entan-glement invariants, for characterising the structure of state spaces for composite quantum systems; and Markov invariants, a robust alternative to parameter-estimation intensive methods of s...
متن کاملLoop Invariant Symbolic Execution for Parallel Programs
Techniques for verifying program assertions using symbolic execution exhibit a significant limitation: they typically require that (small) bounds be imposed on the number of loop iterations. For sequential programs, there is a way to overcome this limitation using loop invariants. The basic idea is to assign new symbolic constants to the variables modified in the loop body, add the invariant to...
متن کاملInvariant Discovery Guided by Symbolic Execution
Program invariants are useful for software implementation, testing, and maintenance activities. However, invariants are difficult to discover, and can take intensive manual effort to validate. A large body of research has focused on automated invariant discovery. The most widely used techniques for invariant discovery (e.g., Daikon) are based on dynamic test execution traces. Although these tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1986
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.83.4.844